Strong Spatial Mixing in Homomorphism Spaces
نویسندگان
چکیده
منابع مشابه
Strong Spatial Mixing in Homomorphism Spaces
Given a countable graph G and a finite graph H, we consider Hom(G ,H) the set of graph homomorphisms from G to H and we study Gibbs measures supported on Hom(G ,H). We develop some sufficient and other necessary conditions on Hom(G ,H) for the existence of Gibbs specifications satisfying strong spatial mixing (with exponential decay rate). We relate this with previous work of Brightwell and Win...
متن کاملCounting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin models. Previous analyses of correlation-decay algorithms implicitly depended on the occurrence of strong spatial mixing. This, roughly, means that one uses worst...
متن کاملComputation Tree and Strong Spatial Mixing in Multi-spin Systems
This paper deals with the construction of a computation tree (hypertree) for interacting systems modeled using graphs (hypergraphs) that preserve the marginal probability of any vertex of interest. Local message passing equations have been used for some time to approximate the marginal probabilities in graphs but it is known that these equations are incorrect for graphs with loops. In this pape...
متن کاملApproximation via Correlation Decay When Strong Spatial Mixing Fails
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin models. Previous analyses of correlation-decay algorithms implicitly depended on the occurrence of strong spatial mixing. This, roughly, means that one uses worst...
متن کاملStrong Spatial Mixing with Fewer Colours for Lattice Graphs∗
Recursively-constructed couplings have been used in the past for mixing on trees. We show how to extend this technique to non-tree-like graphs such as lattices. Using this method, we obtain the following general result. Suppose that G is a triangle-free graph and that for some Δ ≥ 3, the maximum degree of G is at most Δ. We show that the spin system consisting of q-colourings of G has strong sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1066178